Entropy estimators and serial tests for ergodic chains
نویسنده
چکیده
In his 1992 paper entitled “A universal statistical test for random bit generators,” Maurer discusses a statistic whose value is closely related to the per-bit-entropy of an ergodic stationary source. Here we derive an entropy estimate from a class of generalized serial tests and discuss its relationship to return-time-based entropy estimators and frequency-based goodness-of-fit tests. Our setup extends Kullback’s -divergence approach for independent stationary sequences to the class of ergodic Markov chains. The effects caused by the order of the source are examined theoretically and by an empirical study.
منابع مشابه
Estimation of the Entropy Rate of ErgodicMarkov Chains
In this paper an approximation for entropy rate of an ergodic Markov chain via sample path simulation is calculated. Although there is an explicit form of the entropy rate here, the exact computational method is laborious to apply. It is demonstrated that the estimated entropy rate of Markov chain via sample path not only converges to the correct entropy rate but also does it exponential...
متن کاملNonparametric Entropy Estimation for Stationary Processesand Random Fields, with Applications to English Text
We discuss a family of estimators for the entropy rate of a stationary ergodic process and prove their pointwise and mean consistency under a Doeblin-type mixing condition. The estimators are Cesàro averages of longest match-lengths, and their consistency follows from a generalized ergodic theorem due to Maker. We provide examples of their performance on English text, and we generalize our resu...
متن کاملTesting Exponentiality Based on Renyi Entropy of Transformed Data
In this paper, we introduce new tests for exponentiality based on estimators of Renyi entropy of a continuous random variable. We first consider two transformations of the observations which turn the test of exponentiality into one of uniformity and use a corresponding test based on Renyi entropy. Critical values of the test statistics are computed by Monte Carlo simulations. Then, we compare p...
متن کاملEstimating the Entropy of Binary Time Series: Methodology, Some Theory and a Simulation Study
Partly motivated by entropy-estimation problems in neuroscience, we present a detailed and extensive comparison between some of the most popular and effective entropy estimation methods used in practice: The plug-in method, four different estimators based on the Lempel-Ziv (LZ) family of data compression algorithms, an estimator based on the Context-Tree Weighting (CTW) method, and the renewal ...
متن کاملNearest-neighbor entropy estimators with weak metrics
A problem of improving the accuracy of nonparametric entropy estimation for a stationary ergodic process is considered. New weak metrics are introduced and relations between metrics, measures, and entropy are discussed. Based on weak metrics, a new nearest-neighbor entropy estimator is constructed and has a parameter with which the estimator is optimized to reduce its bias. It is shown that est...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001